A Comparison between Genetic and Memetic Algorithm for Automated Music Composition System

نویسندگان

  • Mondheera Pituxcoosuvarn
  • Roberto Legaspi
  • Rafael Cabredo
  • Ken-ichi Fukui
  • Koichi Moriyama
  • Noriko Otani
  • Satoshi Kurihara
  • Masayuki Numao
چکیده

Automatic music composition has been a challenging, interesting, and yet still much to be explored task primarily because it is hard to distinguish which song is good or bad which significantly impedes the automated composition process. Despite this difficulty, automated music composition would benefit many groups of people who ought to use a piece of their own music, as composed for them by an AI system with compositional intelligence, without someone else’s copyright for some purpose such as a music piece for a commercial, or a song played in the background of a presentation. Our composition system composes eight-bar tracks, based on western music theory and listener evaluation. We present here the use of memetic algorithm, comparing to using the conventional genetic algorithm. The same representation and evaluation for both techniques are used because of the similarity of these two algorithms. The main difference of memetic algorithm with genetic algorithm is the local search process. Both algorithms are implemented separately to spot the difference between the results then we evaluated the algorithms. When the outcomes are compared, we found that the use of memetic algorithm performs better in terms of quality of musical piece and convergence speed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

متن کامل

Genetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line

This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...

متن کامل

A Memetic Algorithm for Automated Music Composition

Fall Term 2010 ii ACKNOWLEDGMENTS The author would like to take this opportunity to thank Dr. El Aarag for all of her help in putting this proposal together.

متن کامل

SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...

متن کامل

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013